On Unifying Assumption { Commitment
نویسندگان
چکیده
Assumption{Commitment paradigms for speciication and veriication of concurrent programs have been proposed in the past. We show that two typical parallel composition rules for shared variable and message passing programs 8, 12] which hitherto required diierent formulations are instances of one general rule mainly inspired by Abadi & Lamport's composition theorem 1].
منابع مشابه
On Unifying Assumption-Commitment Style Proof Rules for Concurrency
Assumption{Commitment paradigms for speciication and veriication of concurrent programs have been proposed in the past. We show that two typical parallel composition rules for shared variable and message passing programs 8, 12] which hitherto required diierent formulations are instances of one general rule mainly inspired by Abadi & Lamport's composition theorem 1].
متن کاملParallel Composition of Assumption-commitment Speciications a Unifying Approach for Shared Variable and Distributed Message Passing Concurrency
We unify the parallel composition rule of assumption-commitment speciications for respectively state-based and message-based concurrent processes. Without providing language-dependent deenitions, we rst assume that the model of a process can be given as a set of`sequences' (e.g., traces, state sequences). Then we assume the existence of a merging operator that captures the compositionality of t...
متن کاملHomomorphic Trapdoor Commitments to Group Elements
We present homomorphic trapdoor commitments to group elements. In contrast, previous homomorphic trapdoor commitment schemes only allow the messages to be exponents. Our commitment schemes are length-reducing, we can make a short commitment to many group elements at once, and they are perfectly hiding and computationally binding. The commitment schemes are based on groups with a bilinear map. W...
متن کاملSmooth Entropy and Rényi Entropy
The notion of smooth entropy allows a unifying, generalized formulation of privacy ampli-cation and entropy smoothing. Smooth entropy is a measure for the number of almost uniform random bits that can be extracted from a random source by probabilistic algorithms. It is known that the R enyi entropy of order at least 2 of a random variable is a lower bound for its smooth entropy. On the other ha...
متن کاملSmooth Entropy and R h y i Entropy
The notion of smooth entropy allows a unifying, generalized formulation of privacy amplification and entropy smoothing. Smooth entropy is a measure for the number of almost uniform random bits that can be extracted from a random source by probabilistic algorithms. It is known that the R h y i entropy of order at least 2 of a random variable is a lower bound for its smooth entropy. On the other ...
متن کامل